PLANAR PACKING OF CYCLES AND UNICYCLIC GRAPHS
نویسندگان
چکیده
منابع مشابه
Induced packing of odd cycles in planar graphs
An induced packing of odd cycles in a graph is a packing such that there is no edge in the graph between any two odd cycles in the packing. We prove that the problem is solvable in time O(n ) when the input graph is planar. We also show that deciding if a graph has an induced packing of two odd cycles is NP-complete.
متن کاملCycles And Unicyclic Components In Random Graphs
The sizes of the cycles and unicyclic components in the random graph G(n, n/2 ± s), where n ≪ s ≪ n, are studied using the language of point processes. This refines several earlier results by different authors. Asymptotic distributions of various random variables are given; these distributions include the gamma distributions with parameters 1/4, 1/2 and 3/4, as well as the Poisson–Dirichlet and...
متن کاملPacking Cycles in Graphs
A graph G is called cycle Mengerian (CM) if for any nonnegative integral function w de ned on V (G), the maximum number of cycles in G such that each vertex v is used at most w(v) times is equal to the minimum of Pfw(v) : v 2 Sg, where the minimum is taken over all S V (G) such that deleting S from G results a forest. The purpose of this paper is to characterize all CM graphs in terms of forbid...
متن کاملPacking cycles in graphs, II
A graph G packs if for every induced subgraph H of G, the maximum number of vertexdisjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack.
متن کاملPacking Trees into Planar Graphs
1 I n t r o d u c t i o n We say that the graphs H 1 , . . . , Hk can be packed into a graph G if G contains subgraphs isomorphic to H 1 , . . . , Hk and pairwise edge disjoint. The problem of packing graphs has been widely studied, especially when G is a complete graph. For instance, it is known that two trees with n vertices none of them equal to a star can be packed into K~ [2]. The packing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Demonstratio Mathematica
سال: 2009
ISSN: 2391-4661
DOI: 10.1515/dema-2009-0402